H-Termination proof of /home/matraf/haskell/eval_FullyBlown

YES 0.457 H-Termination proof of /home/matraf/haskell/eval_FullyBlown_Fast/Monad.hs
H-Termination of the given Haskell-Program with start terms could successfully be proven:

↳ HASKELL

  ↳ IFR

mainModule Monad

((unless :: Monad a => Bool -> a () -> a ()) :: Monad a => Bool -> a () -> a ())

module Monad where

import qualified Maybe
import qualified Prelude

unless :: Monad a => Bool -> a () -> a ()

unless

p s

if p then return () else s

module Maybe where

import qualified Monad
import qualified Prelude

If Reductions:
The following If expression

if p then return () else s

is transformed to

unless0 s True = return ()

unless0 s False = s

↳ HASKELL

  ↳ IFR

    ↳ HASKELL

      ↳ BR

mainModule Monad

((unless :: Monad a => Bool -> a () -> a ()) :: Monad a => Bool -> a () -> a ())

module Maybe where

import qualified Monad
import qualified Prelude

module Monad where

import qualified Maybe
import qualified Prelude

unless :: Monad a => Bool -> a () -> a ()

unless

p s

unless0 s p

unless0	s True	=	return ()
unless0	s False	=	s

Replaced joker patterns by fresh variables and removed binding patterns.

↳ HASKELL

  ↳ IFR

    ↳ HASKELL

      ↳ BR

        ↳ HASKELL

          ↳ COR

mainModule Monad

((unless :: Monad a => Bool -> a () -> a ()) :: Monad a => Bool -> a () -> a ())

module Monad where

import qualified Maybe
import qualified Prelude

unless :: Monad a => Bool -> a () -> a ()

unless

p s

unless0 s p

unless0	s True	=	return ()
unless0	s False	=	s

module Maybe where

import qualified Monad
import qualified Prelude

Cond Reductions:
The following Function with conditions

undefined

| False

= undefined

is transformed to

undefined = undefined1

undefined0 True = undefined

undefined1 = undefined0 False

↳ HASKELL

  ↳ IFR

    ↳ HASKELL

      ↳ BR

        ↳ HASKELL

          ↳ COR

            ↳ HASKELL

              ↳ Narrow

mainModule Monad

(unless :: Monad a => Bool -> a () -> a ())

module Maybe where

import qualified Monad
import qualified Prelude

module Monad where

import qualified Maybe
import qualified Prelude

unless :: Monad a => Bool -> a () -> a ()

unless

p s

unless0 s p

unless0	s True	=	return ()
unless0	s False	=	s

Haskell To QDPs

digraph dp_graph {
node [outthreshold=100, inthreshold=100];1[label="unless\n  Monad a",fontsize=16,color="grey",shape="box"];1 -> 3[label="",style="dashed", color="grey", weight=3];
3[label="unless vy3\n  Monad a",fontsize=16,color="grey",shape="box"];3 -> 4[label="",style="dashed", color="grey", weight=3];
4[label="unless vy3 vy4\n  Monad a",fontsize=16,color="black",shape="triangle"];4 -> 5[label="",style="solid", color="black", weight=3];
5[label="unless0 vy4 vy3\n  Monad a",fontsize=16,color="burlywood",shape="box"];19[label="vy3/False",fontsize=10,color="white",style="solid",shape="box"];5 -> 19[label="",style="solid", color="burlywood", weight=9];
19 -> 6[label="",style="solid", color="burlywood", weight=3];
20[label="vy3/True",fontsize=10,color="white",style="solid",shape="box"];5 -> 20[label="",style="solid", color="burlywood", weight=9];
20 -> 7[label="",style="solid", color="burlywood", weight=3];
6[label="unless0 vy4 False\n  Monad a",fontsize=16,color="black",shape="box"];6 -> 8[label="",style="solid", color="black", weight=3];
7[label="unless0 vy4 True\n  Monad a",fontsize=16,color="black",shape="box"];7 -> 9[label="",style="solid", color="black", weight=3];
8[label="vy4\n  Monad a",fontsize=16,color="green",shape="box"];9[label="return ()\n  Monad a",fontsize=16,color="blue",shape="box"];21[label="return :: () -> Maybe ()",fontsize=10,color="white",style="solid",shape="box"];9 -> 21[label="",style="solid", color="blue", weight=9];
21 -> 10[label="",style="solid", color="blue", weight=3];
22[label="return :: () -> IO ()",fontsize=10,color="white",style="solid",shape="box"];9 -> 22[label="",style="solid", color="blue", weight=9];
22 -> 11[label="",style="solid", color="blue", weight=3];
23[label="return :: () -> [] ()",fontsize=10,color="white",style="solid",shape="box"];9 -> 23[label="",style="solid", color="blue", weight=9];
23 -> 12[label="",style="solid", color="blue", weight=3];
10[label="return ()",fontsize=16,color="black",shape="box"];10 -> 13[label="",style="solid", color="black", weight=3];
11[label="return ()",fontsize=16,color="black",shape="box"];11 -> 14[label="",style="solid", color="black", weight=3];
12[label="return ()",fontsize=16,color="black",shape="box"];12 -> 15[label="",style="solid", color="black", weight=3];
13[label="Just ()",fontsize=16,color="green",shape="box"];14[label="primretIO ()",fontsize=16,color="black",shape="box"];14 -> 16[label="",style="solid", color="black", weight=3];
15[label="() : []",fontsize=16,color="green",shape="box"];16[label="terminator ()",fontsize=16,color="black",shape="box"];16 -> 17[label="",style="solid", color="black", weight=3];
17[label="ter0m ()",fontsize=16,color="green",shape="box"];17 -> 18[label="",style="dashed", color="green", weight=3];
18[label="()",fontsize=16,color="green",shape="box"];}